Description: 包括turbo码编译码程序，译码算法包括sova及max-log-map算法，并有完整链路验证其性能。-including turbo coding - decoding procedures, SOVA including decoding algorithm and max-log-map algorithm, and link integrity test its performance. Platform: |
Size: 13265 |
Author:tanbo |
Hits:
Description: 包括turbo码编译码程序，译码算法包括sova及max-log-map算法，并有完整链路验证其性能。-including turbo coding- decoding procedures, SOVA including decoding algorithm and max-log-map algorithm, and link integrity test its performance. Platform: |
Size: 13312 |
Author:tanbo |
Hits:
Description: 基于DSP平台实现turbo码Max_Log_MAP算法，基于标准C 语言研究
了Turbo 码Max - Log - MAP 译码算法的软件编程与实现,为了提高程序的运行效率,结合TMS320C6000 系列DSP 芯片
的结构与特点采用循环展开、数据的存取优化设计、算法改进等措施进行了代码优化,给出了测试结果，非常值得一看-DSP platform based on turbo code Max_Log_MAP algorithm, based on standard C language studied Turbo Code Max- Log- MAP decoding algorithm of the software programming and realize, in order to improve process efficiency, combined with TMS320C6000 DSP chip structure and characteristics of the use of cycle start the design of data access optimization, algorithms and other measures to improve the code optimization, are given the test results, very worth a visit Platform: |
Size: 313344 |
Author:ynhuyong |
Hits:
Description: max-log-map算法的C语言的实现，能计算出所需要的LLR，做出软判决和硬判决。-max-log-map algorithm for the realization of the C language, can be required to calculate LLR, make a hard decision and soft decision. Platform: |
Size: 3072 |
Author:lituguang |
Hits:
Description: turbo码的map,log-map以及max-log-map的算法的c程序仿真-turbo code of the map, log-map and the max-log-map algorithm for c program simulation Platform: |
Size: 5120 |
Author:章剑 |
Hits:
Description: 这是一套完整的支持wimax 16e协议CTC的编译码程序，
主程序在demo.c
译码器：tcdecoder.c
编码器：tcencoder.c-/* This program simulates the classical turbo encoding-decoding system on PC.*/
/* It uses parallel concatenated convolutional codes described in Figure 2.9 in Chapter 2.*/
/* Two component RSC (Recursive Systematic Convolutional) encoders are used. */
/* First encoder is terminated with tails bits. (Info+ tail) bits are scrambled and */
/* passed to the second encoder, while second encoder is left open without tail bits. */
/* Random information bits are modulated into+1/-1, and transmitted through an AWGN channel.*/
/* Interleavers are randomly generated for each frame.*/
/* Log-MAP algorithm without quantization or approximation is used.*/
/* By making use of ln(e^x+e^y) = max (x,y)+ ln(1+e^(-abs(x-y))), */
/* the Log-MAP is simplified with a look-up table for the correction term.*/
/* When the approximation ln(e^x+e^y) = max (x,y) is, we have MAX-Log-MAP.*/
/* To set the number of iterations, change the globle variable "DECITER". To set the fr Platform: |
Size: 26624 |
Author:bennytang |
Hits:
Description: This script simulates the classical turbo encoding-decoding system.
It simulates parallel concatenated convolutional codes.
Two component rate 1/2 RSC (Recursive Systematic Convolutional) component encoders are assumed.
First encoder is terminated with tails bits. (Info + tail) bits are scrambled and passed to
the second encoder, while second encoder is left open without tail bits of itself.
Random information bits are modulated into +1/-1, and transmitted through a AWGN channel.
Interleavers are randomly generated for each frame.
Log-MAP algorithm without quantization or approximation is used.
By making use of ln(e^x+e^y) = max(x,y) + ln(1+e^(-abs(x-y))),
the Log-MAP can be simplified with a look-up table for the correction function.
If use approximation ln(e^x+e^y) = max(x,y), it becomes MAX-Log-MAP.- This script simulates the classical turbo encoding-decoding system.
It simulates parallel concatenated convolutional codes.
Two component rate 1/2 RSC (Recursive Systematic Convolutional) component encoders are assumed.
First encoder is terminated with tails bits. (Info + tail) bits are scrambled and passed to
the second encoder, while second encoder is left open without tail bits of itself.
Random information bits are modulated into +1/-1, and transmitted through a AWGN channel.
Interleavers are randomly generated for each frame.
Log-MAP algorithm without quantization or approximation is used.
By making use of ln(e^x+e^y) = max(x,y) + ln(1+e^(-abs(x-y))),
the Log-MAP can be simplified with a look-up table for the correction function.
If use approximation ln(e^x+e^y) = max(x,y), it becomes MAX-Log-MAP. Platform: |
Size: 2048 |
Author:yk |
Hits:
Description: 1. 程序中Turbo译码采用了MAP,LOG-MAP，和MAX-LOG-MAP三种算法。
2. 以xxx开头的四个mat文件是四种给定的Turbo码在译码时用到的参数，保存下来的目的是
加快仿真的速度，如果你所仿真的Turbo码不是程序中列出的任意一种，你可以通过函数
trellis来生成自己的相关参数。
3. 程序支持1/2和1/3两种码率的Turbo码，其中1/2码率的Turbo码通过矩阵[1 0 0 1]打
孔得到。在译码时通过对打孔位置添0恢复成1/3码率的码字。
4. 程序中的信噪比表示Eb/N0，通过此参数求得N0，对发送信号进行加噪。-1 program in Turbo decoding using the MAP, the LOG-MAP, and three kinds of the MAX-LOG-MAP algorithm. Platform: |
Size: 1408000 |
Author:谢小谢 |
Hits:
Description: 这部分代码主要实现了TURBO码的编解码，运用max-log-map译码方法进行译码-this code realise the encode and decode function of turbo,the decoding algorithm is by max-log-map Platform: |
Size: 19456 |
Author:韩晓宇 |
Hits:
Search - max log map algorithm